A Logical Programming Language∗
نویسندگان
چکیده
In this paper we consider a family of languages (USWIM) which is based on Landin’s ISWIM (the individual languages being determined by appropriate continuous algebras of data objects and operations on these objects). We give a simple mathematical semantics for USWIM, and also give a system of program manipulation rules and a system of inference rules for reasoning about USWIM programs, the latter using a system of “program annotation” which allows inner, local environments to be discussed. USWIM is the basis on which Structured Lucid is built. The commonplace expressions of arithmetic and algebra have a certain simplicity that most communications to computers look. P. J. Landin, 1966.
منابع مشابه
Step-Indexed Logical Relations for Probability
It is well-known that constructing models of higher-order probabilistic programming languages is challenging. We show how to construct step-indexed logical relations for a probabilistic extension of a higher-order programming language with impredicative polymorphism and recursive types. We show that the resulting logical relation is sound and complete with respect to the contextual preorder and...
متن کاملMnesia - An Industrial DBMS with Transactions, Distribution and a Logical Query Language
Mnesia is a full DBMS made for telecommunications industrial needs. It has distributed transactions, fast real time lookups, crash recovery and a logical query language. The DBMS is written in the functional language Erlang which is also the intended applications language. It already has real users devel-
متن کاملFunctional Programming with Logical Frameworks
Functional Programming with Logical Frameworks Adam Brett Poswolsky 2008 Logical frameworks are languages used to represent information. In this dissertation we present the Delphin programming language, which is a functional programming language with a logical framework supporting both higher-order abstract syntax and dependent types. Higher-order abstract syntax, or HOAS, refers to the techniq...
متن کاملA Logical Relation for Monadic Encapsulation of State
We present a logical relations model of a higher-order functional programming language with impredicative polymorphism, recursive types, and a Haskell-style ST monad type with runST. We use our logical relations model to show that runST provides proper encapsulation of state, by showing that effectful computations encapsulated by runST are heap independent. Furthermore, we show that contextual ...
متن کاملUltrametric Domain Theory and Semantics in Coq
We present a Coq formalization of ultrametric spaces and of ultrametric-enriched categories, up to and including the construction of solutions to recursive domain equations in ultrametric-enriched categories. We then show how to apply this semantic setup for giving semantics to a programming language with higher-order store. Specifically, we define a step counting operational semantics for a fu...
متن کاملA logical analysis of entanglement and separability in quantum higher-order functions
We present a logical separability analysis for a functional quantum computation language. This logic is inspired by previous works on logical analysis of aliasing for imperative functional programs. Both analyses share similarities notably because they are highly non-compositional. Quantum setting is harder to deal with since it introduces non determinism and thus considerably modifies semantic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012